package com.wc.alorithm_blue_bridge._二分.元宵交友;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2025/4/3 13:52
 * @description
 * https://www.lanqiao.cn/problems/20258/learning/?contest_id=241
 */
public class Main {
    /**
     * 思路：
     * 二分找最远距离能来的, 时间复杂度是调和级数
     * 因为第一次 n, 相隔两个 n / 2, 同理 n / n;
     */
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 1000010;
    static int[] a = new int[N];
    static int n;

    public static void main(String[] args) {
        n = sc.nextInt();
        for (int i = 1; i <= n; i++) a[i] = sc.nextInt();
        Arrays.sort(a, 1, n + 1);
        for (int i = 1; i <= n; i++) {
            int res = 1, j = 1;
            while (j <= n) {
                int l = j, r = n;
                while (l < r) {
                    int mid = l + r >> 1;
                    if (a[mid] - a[j] >= i) r = mid;
                    else l = mid + 1;
                }
                if (a[r] - a[j] >= i) {
                    res ++;
                    j = r;
                } else break;
            }
            out.print(res + " ");
        }
        out.flush();
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}

